NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
891	Scotch and libScotch 4.0 User’s Guide∗ Fran¸cois Pellegrini ScAlApplix project, INRIA Futurs ENSEIRB & LaBRI, UMR CNRS 5800 Universit´e Bordeaux I 351 cours de la Lib´eration, 33405 TALENCE, FRANCE Add to Reading List Source URL: www.labri.fr Language: English - Date: 2007-08-08 05:02:28 NP-complete problems Shortest path problem Tree Graph Graph theory Theoretical computer science Mathematics
892	Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) Tom´ aˇs Balyo1 , Andreas Fr¨ohlich2 , Marijn J. H. Heule3 , Armin Biere2 ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 10:00:09 Automated theorem proving Logic in computer science Propositional calculus NP-complete problems Logic programming Boolean satisfiability problem Unit propagation Conjunctive normal form Resolution Theoretical computer science Mathematics Mathematical logic
893	Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads (PRELIMINARY VERSION; [removed]) ⋆ Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-25 04:19:32 Logic in computer science NP-complete problems Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Satz Lookahead Solver Theoretical computer science Mathematics Applied mathematics
894	Improvement of the E ien y of Geneti Algorithms for S alable Parallel Graph Partitioning in a Multi-Level Framework Cédri Chevalier and François Pellegrini LaBRI and INRIA Futurs Add to Reading List Source URL: www.labri.fr Language: English - Date: 2006-05-21 08:07:32 NP-complete problems Applied mathematics Degree Topological graph theory Graph partition Theoretical computer science Mathematics Graph theory
895	Exact DFA Identification Using SAT Solvers Marijn J.H. Heule1, and Sicco Verwer2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:36:36 Automata theory NP-complete problems Graph coloring Graph theory Boolean satisfiability problem Deterministic finite automaton Clique DFA Records Powerset construction Theoretical computer science Mathematics Applied mathematics
896	Clause Elimination Procedures for CNF Formulas Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Software Technology, Delft University of Technology, The Netherlands Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:34:30 Automated theorem proving Mathematical logic Propositional calculus Logic in computer science NP-complete problems Conjunctive normal form Resolution Boolean satisfiability problem Unit propagation Theoretical computer science Logic Mathematics
897	To appear in 13th International Conference on Computer Vision, 6-13 November 2011, Barcelona, Spain. Image Segmentation by Figure-Ground Composition into Maximal Cliques Adrian Ion∗, Joao Carreira, Cristian Sminchises Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2014-06-04 23:25:00 Applied mathematics Image processing Segmentation Geometry Tessellation Market segmentation Clique problem Clique Independent set Mathematics Tiling NP-complete problems
898	Revisiting Hyper Binary Resolution Marijn J.H. Heule1,3 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Computer Science, The University of Texas at Austin, United States Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:06:39 Automated theorem proving Logic in computer science NP-complete problems Conjunctive normal form Resolution Unit propagation Boolean satisfiability problem Literal Transitivity Theoretical computer science Mathematical logic Mathematics
899	Covered Clause Elimination Marijn Heule∗ TU Delft, The Netherlands Matti J¨arvisalo† Univ. Helsinki, Finland Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:30:47 Automated theorem proving Logic in computer science NP-complete problems Logic programming Conjunctive normal form Boolean satisfiability problem Unit propagation Resolution Clause Theoretical computer science Mathematical logic Mathematics
900	DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt, Jr. ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-04-02 18:01:43 Automated theorem proving Formal methods NP-complete problems Constraint programming Logic in computer science True quantified Boolean formula Resolution Satisfiability Modulo Theories Unsatisfiable core Theoretical computer science Mathematics Logic

UPDATE